Ultrafilters on a countable set

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Walks on Countable Ordinals and Selective Ultrafilters

In our previous work we have introduced filters on the set of countable ordinals as invariants to standard characteristics of walks in this domain. In this note we examine their projections to the set of natural numbers.

متن کامل

On the structure of measurable filters on a countable set

A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters. The goal of this paper is to characterize measurable filters on the set of natural numbers. In section 1 we introduce basic notions, in section 2 we find a combinatorial characterization of measurable filters, in section 3 ...

متن کامل

On Countable Families of Topologies on a Set

Considering a countable number of topologies on a set X, we introduce the notion of (א0)topological spaces as a generalization of the notions of both bitopological spaces and (ω)topological spaces, and study some of their properties. AMS Mathematics Subject Classification (2000): 54A10

متن کامل

The Largest Countable Inductive Set is A Mouse Set

Let R be the least ordinal such that L (R) is admissible. Let A = fx 2 R j (9 < R) s.t. x is ordinal deenable in L (R) g. It is well known that (assuming determinacy) A is the largest countable inductive set of reals. Let T be the theory: ZFC Replacement + \There exists ! Woodin cardinals which are coonal in the ordinals." T has consistency strength weaker than that of the theory ZFC + \There e...

متن کامل

Menger's Theorem for a Countable Source Set

Paul Erd} os has conjectured that Menger's theorem extends to innnite graphs in the following way: whenever A; B are two sets of vertices in an innnite graph, there exist a set of disjoint A{B paths and an A{B separator in this graph so that the separator consists of a choice of precisely one vertex from each of the paths. We prove this conjecture for graphs that contain a set of disjoint paths...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Mathematical Logic

سال: 1970

ISSN: 0003-4843

DOI: 10.1016/0003-4843(70)90005-7